package com.LC._122;

import javax.xml.transform.Source;

class Solution {
    public int maxProfit(int[] prices) {
    int result = 0;
    for(int i=1;i<prices.length;i++) {
        if(prices[i]>prices[i-1]){
            result = result+ prices[i]-prices[i-1];
        }else{
            continue;
        }
    }
    return result;
    }

    public static void main(String[] args) {
        Solution solution = new Solution();
        int[] n=new int[]{7,1,5,3,6,4};
        System.out.println(solution.maxProfit(n));
    }
}